Optimal production ramp-up in the smartphone manufacturing industry

Motivated by challenges in the smartphone manufacturing industry, we develop a dynamic production ramp-up model that can be applied to economically satisfy nonstationary demand for short-life-cycle products by high-tech companies. Due to shorter life cycles and more rapid evolution of smartphones, production ramp-up has been increasingly critical to the success of a new smartphone. In the production ramp-up, the key challenge is to match the increasing capacity to nonstationary demand. The high-tech smartphone manufacturers are urged to jointly consider the effect of increasing capacity and decreasing demand. We study the production planning problem using a high-dimensional Markov decision process (MDP) model to characterize the production ramp-up. To address the curse of dimensionality, we refine Monte Carlo tree search (MCTS) algorithm and theoretically analyze its convergence and computational complexity. In a real case study, we find that the MDP model achieves revenue improvement by stopping producing the existing product earlier than the benchmark policy. In synthetic instances, we validate that the proposed MCTS algorithm saves computation time without loss of solution quality compared with traditional value iteration algorithm. As part of the Lenovo production solution, our MDP model enables high-tech smartphone manufacturers to better plan the production ramp-up.     

Effects of cueing in cooperative search

We consider the effects of cueing in a cooperative search mission that involves several autonomous agents. Two scenarios are discussed: one in which the search is conducted by a number of identical search‐and‐engage vehicles and one where these vehicles are assisted by a search‐only (reconnaissance) asset. The cooperation between the autonomous agents is facilitated via cueing, i.e., the information transmitted to the agents by a searcher that has just detected a target. The effect of cueing on the target detection probability is derived from first principles using a Markov chain analysis. In particular, it is demonstrated that the benefit of cueing on the system's effectiveness is bounded. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

马尔可夫随机场中应用蚁群系统的红外图像分割

利用蚁群系统(ACS)的信息正反馈和启发式的搜索特点,针对马尔可夫随机场(MRF)图像模型的局部相关特性和最大后验概率(MAP)估计,可以在较短时间内得到图像分割目标函数的全局最优解,从而可以避免传统模拟退火算法的庞大时间复杂度.通过对军用红外图像的分割实验,可以看出这种算法能够在抗噪声、保留目标边缘和降低时间复杂度方面得到较满意的结果.     

马尔科夫链扫雷效果评估模型可信度验证

目前基于马尔科夫链的扫雷作战效果评估模型从单链到多链,理论模型与算法设计已经架构完毕,但该模型的可信度还有待验证。文中利用误差分布拟合检验的方法,对模型可信度进行验证,计算表明,该模型可信度较好。     

非高斯噪声下信号盲检测算法*

针对实际甚低频和超低频接收机不仅受非高斯噪声的影响,同时受到接收机内部和外部环境中高斯噪声影响的问题,对噪声采用高斯尺度混合分布和高斯分布的混合模型建模,根据混合模型的性质,设计了一种基于马尔可夫链蒙特卡罗方法的信号盲检测算法。盲检测算法在贝叶斯层次模型下,采用Gibbs抽样和M-H抽样更新参数,同步检测信道衰落系数、噪声模型参数和信号。算法迭代效率快、精度高。通过与最优检测性能比较,盲检测算法性能优异,对甚低频和超低频信号接收具有重要的现实意义。     

基于GSPN的编队网络化防空指挥流程研究

为了提高编队指挥员在信息化海战中的作战指挥效率和应变能力,利用广义随机Petri网与马尔可夫链的等价关系,得到一种Petri网与马尔可夫链理论相结合的指挥流程时间性能分析的新方法,通过对模型进行分析与求解,得出了舰艇编队网络化防空作战指挥流程活动的准确作战周期,从而为指挥流程的优化提供有力的支撑,对评估系统效能水平也具有重要指导意义。     

基于信息链的防空作战体系能力分析方法

针对要地防空指挥控制系统的组成、结构和功能,通过双层图对作战体系结构进行建模,提出体现作战体系作战业务流程、信息连通性的双层信息链搜索和解析方法,实现了将信息链与作战体系能力分析的有机关联。仿真验证表明,该方法有效地体现了在作战体系能力分析中,各类型作战实体的协作性和连通性,提高了作战体系作战能力与体系结构的融合能力,利于作战体系的作战效能评估。     

基于FMECA的信息系统软件失效安全风险评估与预测

随着大量软件产品应用于信息系统,不可避免地增大了软件失效对系统安全的影响概率。本文以某信息系统文电收发的处理过程为例,引入FMECA法,对其文电收发处理过程中由软件造成的风险进行分析,同时分析了引起风险常见的失效模式,并引入Markov模型对软件失效造成系统严重危害的风险进行预测,通过Markov模型与FMECA法结合能够迅速定位软件失效的原因,减少因软件失效造成的系统损失。     

9/11: WHAT DID WE KNOW AND WHEN DID WE KNOW IT?

In February 1998, Osama Bin Laden published a signed statement calling for a fatwa against the United States for its having ‘declared war against God’. As we now know, the fatwa resulted in the unprecedented attack of 9/11. The issue of whether or not 9/11 was in any way predictable culminated in the public debate between Richard Clarke, former CIA Director George Tenet and the White House. This paper examines whether there was any evidence of a structural change in the terrorism data at or after February 1998 but prior to June 2001, controlling for the possibility of other breaks in earlier periods. In doing so, we use the standard Bai–Perron procedure and our sequential importance sampling (SIS) Markov Chain Monte Carlo (MCMC) method for identifying an unknown number of breaks at unknown dates. We conclude that sophisticated statistical time‐series analysis would not have predicted 9/11.     

基于抽象隐马尔可夫模型的CGF路径规划识别

路径规划识别是一种以位置信息为输入的在线识别。为了使CGF能在仿真中识别对手的路径和终点目标,在分析路径规划层次的基础上引入了抽象隐马尔可夫模型的识别框架。针对标准模型在对手更改终点目标和自上而下规划时无法识别的问题,提出了一种顶层策略可变的抽象隐马尔可夫模型。为模型的顶层策略增加初始分布和策略终止变量,更改了策略终止变量间的依赖关系,使下层策略能被强制终止。给出了改进后DBN结构,并通过推导条件概率更新和RB变量抽样流程实现了模型的近似推理。仿真实验表明,改进模型能准确识别给定环境下的各类典型航迹,不仅在终点目标不变时能较好地维持标准模型的识别准确率,在提供足够的观测数据后还能很好地解决变目标识别问题。